Additivity of uncertainty measures on credal sets
نویسندگان
چکیده
A general way of representing incomplete information is to use closed and convex sets of probability distributions, which are also called credal sets. Each credal set is associated with uncertainty, whose amount is quantified by an appropriate uncertainty measure. One of the requisite properties of uncertainty measures is the property of additivity, which is associated with the concept of independence. For credal sets, the concept of independence is not unique. This means that different definitions of independence lead to different definitions of additivity for uncertainty measures. In this paper, we compare the various definitions of independence, but our principal aim is to analyze those definitions that are employed in the most significant uncertainty measures established in the literature for credal sets.
منابع مشابه
Disaggregated total uncertainty measure for credal sets
We present a new approach to measure uncertainty/information applicable to theories based on convex sets of probability distributions, also called credal sets. A definition of a total disaggregated uncertainty measure on credal sets is proposed in this paper motivated by recent outcomes. This definition is based on the upper and lower values of Shannon’s entropy for a credal set. We justify the...
متن کاملUpper entropy of credal sets. Applications to credal classification
We present an application of the measure of entropy for credal sets: as a branching criterion for constructing classification trees based on imprecise probabilities which are determined with the imprecise Dirichlet model. We also justify the use of upper entropy as a global uncertainty measure for credal sets and present a deduction of this measure. We have carried out several experiments in wh...
متن کاملCredal decision trees in noisy domains
Credal Decision Trees (CDTs) are algorithms to design classifiers based on imprecise probabilities and uncertainty measures. In this paper, the C4.5 and CDT procedures are combined in a new one. This depends on a parameter s. Several experiments are carried out with different values for s. The new procedure obtains better performance than C4.5 on data sets with different noise levels.
متن کاملSet-Based Variational Methods in Credal Networks: the SV2U Algorithm
Abstract. Graphical models that represent uncertainty through sets of probability measures are often referred to as credal networks. Polynomial-time exact inference methods are available only for polytree-structured binary credal networks. In this work, we approximate potentially intractable inferences in multiconnected binary networks by tractable inferences in polytree-structures. We propose ...
متن کاملInference in Credal Networks using Multilinear Programming
A credal network is a graphical tool for representation and manipulation of uncertainty, where probability values may be imprecise or indeterminate. A credal network associates a directed acyclic graph with a collection of sets of probability measures; in this context, inference is the computation of tight lower and upper bounds for conditional probabilities. In this paper we present new algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. General Systems
دوره 34 شماره
صفحات -
تاریخ انتشار 2005